By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 6, Issue 3, pp. 403-606

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Implementation Correctness Involving a Language with goto Statements

Bruce D. Russell

pp. 403-415

BibTeX  Abstract Full Text:  PDF

Two-Processor Scheduling with Start-Times and Deadlines

M. R. Garey and D. S. Johnson

pp. 416-426

BibTeX  Abstract Full Text:  PDF

A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions

Wolfgang J. Paul

pp. 427-443

BibTeX  Abstract Full Text:  PDF

On Resolution with Clauses of Bounded Size

Zvi Galil

pp. 444-459

BibTeX  Abstract Full Text:  PDF

The Tape Comilexity of Some Classes of Szilard Languages

Y. Igarashi

pp. 460-466

BibTeX  Abstract Full Text:  PDF

The Computational Complexity of Provability in Systems of Modal Propositional Logic

Richard E. Ladner

pp. 467-480

BibTeX  Abstract Full Text:  PDF

A Linear Time Algorithm for a $2 \times n$ Transportation Problem

D. L. Adolphson and G. N. Thomas

pp. 481-486

BibTeX  Abstract Full Text:  PDF

Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays

Joel I. Seiferas

pp. 487-504

BibTeX  Abstract Full Text:  PDF

A New Algorithm for Generating All the Maximal Independent Sets

Shuji Tsukiyama, Mikio Ide, Hiromu Ariyoshi, and Isao Shirakawa

pp. 505-517

BibTeX  Abstract Full Text:  PDF

Worst Case Analysis of Two Scheduling Algorithms

Shui Lam and Ravi Sethi

pp. 518-536

BibTeX  Abstract Full Text:  PDF

Finding a Maximum Independent Set

Robert Endre Tarjan and Anthony E. Trojanowski

pp. 537-546

BibTeX  Abstract Full Text:  PDF

Succinctness of Descriptions of Unambiguous Context-Free Languages

Erik Meineche Schmidt and Thomas G. Szymanski

pp. 547-553

BibTeX  Abstract Full Text:  PDF

The Partial Fraction Expansion Problem and Its Inverse

Francis Y. Chin

pp. 554-562

BibTeX  Abstract Full Text:  PDF

An Analysis of Several Heuristics for the Traveling Salesman Problem

Daniel J. Rosenkrantz, Richard E. Stearns, and Philip M. Lewis, II

pp. 563-581

BibTeX  Abstract Full Text:  PDF

Fast Algorithms for Partial Fraction Decomposition

H. T. Kung and D. M. Tong

pp. 582-593

BibTeX  Abstract Full Text:  PDF

Location of a Point in a Planar Subdivision and Its Applications

D. T. Lee and F. P. Preparata

pp. 594-606

BibTeX  Abstract Full Text:  PDF